An Encrypted In-Memory Column-Store: The Onion Selection Problem
نویسندگان
چکیده
Processing encrypted queries in the cloud has been extended by CryptDB’s approach of adjustable onion encryption. This adjustment of the encryption entails a translation of an SQL query to an equivalent query on encrypted data. We investigate in more detail this translation and in particular the problem of selecting the right onion layer. Our algorithm extends CryptDB’s approach by three new functions: configurable onions, local execution and searchable encryption. We have evaluated our new algorithm in a prototypical implementation in an in-memory column store database system.
منابع مشابه
DEMO: Adjustably Encrypted In-Memory Column-Store
Recent databases are implemented as in-memory columnstores. Adjustable encryption offers a solution to encrypted database processing in the cloud. We show that the two technologies play well together by providing an analysis and prototype results that demonstrate the impact of mechanisms at the database side (dictionaries and their compression) and cryptographic mechanisms at the adjustable enc...
متن کاملP8: Thalamic Damage and Memory
Memory is the cognitive ability that allows acquiring, store and recalling information. Anterior thalamic dysfunction creates memory deficits in rats and humans. Anterior thalamus forms a memory network in connection with the hippocampus. This connectivity profile proposes that ventrolateral and anterior thalamus may display a nexus between reminder and control functions, such as action or atte...
متن کاملSearchable Encryption to Reduce Encryption Degradation in Adjustably Encrypted Databases
Processing queries on encrypted data protects sensitive data stored in cloud databases. CryptDB has introduced the approach of adjustable encryption for such processing. A database column is adjusted to the necessary level of encryption, e.g. order-preserving, for the set of executed queries, but never reversed. This has the drawback that long running cloud databases will eventually transform i...
متن کاملHCS: Hierarchical Cut Selection for Efficiently Processing Queries on Data Columns using Hierarchical Bitmap Indices
When data are large and query processing workloads consist of data selection and aggregation operations (as in online analytical processing), column-oriented data stores are generally the preferred choice of data organization, because they enable effective data compression, leading to significantly reduced IO. Most columnstore architectures leverage bitmap indices, which themselves can be compr...
متن کاملOrder preserving encryption for wide column stores
Order-preserving encryption (OPE) allows encrypting without losing information about the order relation between the encrypted data items. Thus, the execution of compare, order and grouping operations can be done like on plaintext data. In particular it allows databases to do range queries over encrypted data, which is a useful feature especially for cloud databases that usually run in untrusted...
متن کامل